Ends,tangles and critical vertex sets

We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?₀‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.     

Erratum: The average degree of an edge-chromatic critical graph II

In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree $\mathrm{\Delta }$ is at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+1\right)$ if $\mathrm{\Delta }⩾2$, at least $\text{◂+▸}\frac{2}{3}\mathrm{\Delta }+1$ if $\mathrm{\Delta }⩾8$, and at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+2\right)$ if $\mathrm{\Delta }⩾15$. Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if $\mathrm{\Delta }⩾18$ and $\mathrm{\Delta }⩾30$, respectively.     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

On the threshold problem for Latin boxes

Let m ≤ n ≤ k. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of K_n,n.     

On circular–linear one-factorizations of the complete graph

In Korchmáros et al. (2018)one-factorizations of the complete graph $K_n$ are constructed for $n=q+1$ with any odd prime power $q$ such that either $q\equiv 1(mod4)$ or $q=2^h?1$. The arithmetic restriction $n=q+1$ is due to the fact that the vertices of $K_n$ in the construction are the points of a conic $\Omega$ in the finite plane of order $q$. Here we work on the Euclidean plane and describe an analogous construction where the role of $\Omega$ is taken by a regular $n$-gon. This allows us to remove the above constraints and construct one-factorizations of $K_n$ for every even $n\ge 6$.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.